GATE CSE 2008
Q51.
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due toQ52.
If P, Q, R are subsets of the universal set U, then (P\cap Q\cap R)\cup (P^{C} \cap Q \cap R)\cup Q^{C} \cup R^{C} isQ53.
Which of the following are true? I. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation II. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions III. Recursion in programming languages cannot be implemented with dynamic storage allocation IV. Nesting procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records V. Programming languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation recordsQ54.
Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements. Let T(n) be the number of comparisons required to sort n elements. ThenQ55.
Dijkstra's single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance toQ56.
A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a socket(), a bind() and a listen() system call in that order, following which it is preempted. Subsequently, the client process P executes a socket() system call followed by connect() system call to connect to the server process S. The server process has not executed any accept() system call. Which one of the following events could take place?Q57.
A process executes the following codefor (i = 0; i < n; i + +) fork( );The total number of child processes created isQ59.
In the slow start phase of the TCP congestion control algorithm, the size of the congestion windowQ60.
What is the maximum size of data that the application layer can pass on to the TCP layer below?